package pl.mmadej.ds4java.ds.tree;


public interface Tree<T> {

    boolean insert(T element);

    boolean contains(T element);

    boolean delete(T element);

    int numberOfElements();

    <E> E[] levelOrder(E[] e);

    <E> E[] preOrder(E[] e);

    <E> E[] postOrder(E[] e);
}
